#include <bits/stdc++.h>
using namespace std;

int n,ans;
int a[100005];
bool out[100005];
bool attack[100005];
bool f = false;

long long quick_pow(int a,int n,int m){
	long long temp = 1;
	for (;n;n>>=1){
		if (n&1) temp = 1ll*temp*a%m;
		a = 1ll*a*a%m;
	}
	return temp;
}

int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin>>n;
	for (int i = 1;i<=n;i++) cin>>a[i];
	sort(a+1,a+1+n);
	for (int i = 1;i<=n;i++){
		if (out[i] == false){
			bool f = false;
			for (int j = i;j<=n;j++){
				if (a[i]<a[j]&&attack[j] == false&&out[j] == false){
					out[i] = true;
					attack[j] = true;
					ans++;
					f = true;
					break;
				}			
			}
			if (!f){
				attack[i] = true;
			}
		}
	}
	cout<<n-ans;
	return 0;	
}
